The binary modal logic of the intersection types
نویسندگان
چکیده
Let us quickly recall the main ideas of intersection type lambda calculus (for a recent paper on this topic see [6]). It is well known that the pure lambda calculus Λ (see [2]) formalizes the notion of computable function without any reference to the concepts of domain and co-domain, contrary to what happens in the set theoretic or the categorical approach. The main advantage of this approach is the possibility of coding any recursive function within a very simple formalism. Indeed, a lambda term is built inductively, starting from variables, by means of lambda abstraction and a free form of application, that is, we have the following term formation rules:
منابع مشابه
A binary modal logic for the intersection types of lambda-calculus
Intersection types discipline allows to define a wide variety of models for the type free lambda-calculus, but the Curry-Howard isomorphism breaks down for this kind of type systems. In this paper we show that the correspondence between types and suitable logical formulas can still be recovered appealing to the fact that there is a strict connection between the semantics for lambda-calculus ind...
متن کاملSuhrawardi's Modal Syllogisms
Suhrawardi’s logic of the Hikmat al-Ishraq is basically modal. So to understand his modal logic one first has to know the non-modal part upon which his modal logic is built. In my previous paper ‘Suhrawardi on Syllogisms’(3) I discussed the former in detail. The present paper is an exposition of his treatment of modal syllogisms. On the basis of some reasonable existential presuppositi...
متن کاملNONDET~IIi~ISTiC PROPOSITIONAL DYNAMIC LOGIC ~ITH II~T~Q~ECTION IS DECIDABLE
Propositional Dynamic Logic (PDL) of [FL] defines meaning of programs in terms of binary input-output relations. Basic regular operations on programs are interpreted as superposition, union, and reflexive-transitive closure of relations. The intersection, cf. [HI , is a binary program forming functor a~b with the meaning given by the set-theoretical intersection of relations corresponding to pr...
متن کاملA new proof of completeness for a relative modal logic with composition and intersection
This paper is devoted to the completeness issue of RMLCI | the relative modal logic with composition and intersection | a restriction of the propositional dynamic logic with intersection. The trouble with RMLCI is that the operation of intersection is not modally deenable. Using the notion of mosaics, we give a new proof of a theorem considered in a previous paper \Complete axiomatization of a ...
متن کاملLogic of subtyping
We introduce new modal logical calculi that describe subtyping properties of Cartesian product and disjoint union type constructors as well as mutually-recursive types defined using those type constructors. Basic Logic of Subtyping S extends classical propositional logic by two new binary modalities ⊗ and ⊕. An interpretation of S is a function that maps standard connectives into set-theoretica...
متن کامل